Post algorithm - tradução para russo
Diclib.com
Dicionário ChatGPT
Digite uma palavra ou frase em qualquer idioma 👆
Idioma:

Tradução e análise de palavras por inteligência artificial ChatGPT

Nesta página você pode obter uma análise detalhada de uma palavra ou frase, produzida usando a melhor tecnologia de inteligência artificial até o momento:

  • como a palavra é usada
  • frequência de uso
  • é usado com mais frequência na fala oral ou escrita
  • opções de tradução de palavras
  • exemplos de uso (várias frases com tradução)
  • etimologia

Post algorithm - tradução para russo

Dominator (node); Lengauer-Tarjan's algorithm; Postdominate; Postdominance; Lengauer–Tarjan's algorithm; Lengauer–Tarjan algorithm; Lengauer-Tarjan algorithm; Post-dominator; Postdominator; Post-dominance; Dominator tree
  • Example control-flow graph with entry node 1
  • Corresponding ''dominator tree'' of the control flow graph

Post algorithm      

общая лексика

алгоритм Поста

algorithm         
  • Alan Turing's statue at [[Bletchley Park]]
  • The example-diagram of Euclid's algorithm from T.L. Heath (1908), with more detail added. Euclid does not go beyond a third measuring and gives no numerical examples. Nicomachus gives the example of 49 and 21: "I subtract the less from the greater; 28 is left; then again I subtract from this the same 21 (for this is possible); 7 is left; I subtract this from 21, 14 is left; from which I again subtract 7 (for this is possible); 7 is left, but 7 cannot be subtracted from 7." Heath comments that "The last phrase is curious, but the meaning of it is obvious enough, as also the meaning of the phrase about ending 'at one and the same number'."(Heath 1908:300).
  • "Inelegant" is a translation of Knuth's version of the algorithm with a subtraction-based remainder-loop replacing his use of division (or a "modulus" instruction). Derived from Knuth 1973:2–4. Depending on the two numbers "Inelegant" may compute the g.c.d. in fewer steps than "Elegant".
  • 1=IF test THEN GOTO step xxx}}, shown as diamond), the unconditional GOTO (rectangle), various assignment operators (rectangle), and HALT (rectangle). Nesting of these structures inside assignment-blocks results in complex diagrams (cf. Tausworthe 1977:100, 114).
  • A graphical expression of Euclid's algorithm to find the greatest common divisor for 1599 and 650
<syntaxhighlight lang="text" highlight="1,5">
 1599 = 650×2 + 299
 650 = 299×2 + 52
 299 = 52×5 + 39
 52 = 39×1 + 13
 39 = 13×3 + 0</syntaxhighlight>
SEQUENCE OF INSTRUCTIONS TO PERFORM A TASK
Algorithmically; Computer algorithm; Properties of algorithms; Algorithim; Algoritmi de Numero Indorum; Algoritmi de numero indorum; Algoritmi De Numero Indorum; Алгоритм; Algorithem; Software logic; Computer algorithms; Encoding Algorithm; Naive algorithm; Naïve algorithm; Algorithm design; Algorithm segment; Algorithmic problem; Algorythm; Rule set; Continuous algorithm; Algorithms; Software-based; Algorithmic method; Algorhthym; Algorthym; Algorhythms; Formalization of algorithms; Mathematical algorithm; Draft:GE8151 Problem Solving and Python Programming; Computational algorithms; Optimization algorithms; Algorithm classification; History of algorithms; Patented algorithms; Algorithmus
algorithm noun math. алгоритм algorithm validation - проверка правильности алгоритма
algorithmic method         
  • Alan Turing's statue at [[Bletchley Park]]
  • The example-diagram of Euclid's algorithm from T.L. Heath (1908), with more detail added. Euclid does not go beyond a third measuring and gives no numerical examples. Nicomachus gives the example of 49 and 21: "I subtract the less from the greater; 28 is left; then again I subtract from this the same 21 (for this is possible); 7 is left; I subtract this from 21, 14 is left; from which I again subtract 7 (for this is possible); 7 is left, but 7 cannot be subtracted from 7." Heath comments that "The last phrase is curious, but the meaning of it is obvious enough, as also the meaning of the phrase about ending 'at one and the same number'."(Heath 1908:300).
  • "Inelegant" is a translation of Knuth's version of the algorithm with a subtraction-based remainder-loop replacing his use of division (or a "modulus" instruction). Derived from Knuth 1973:2–4. Depending on the two numbers "Inelegant" may compute the g.c.d. in fewer steps than "Elegant".
  • 1=IF test THEN GOTO step xxx}}, shown as diamond), the unconditional GOTO (rectangle), various assignment operators (rectangle), and HALT (rectangle). Nesting of these structures inside assignment-blocks results in complex diagrams (cf. Tausworthe 1977:100, 114).
  • A graphical expression of Euclid's algorithm to find the greatest common divisor for 1599 and 650
<syntaxhighlight lang="text" highlight="1,5">
 1599 = 650×2 + 299
 650 = 299×2 + 52
 299 = 52×5 + 39
 52 = 39×1 + 13
 39 = 13×3 + 0</syntaxhighlight>
SEQUENCE OF INSTRUCTIONS TO PERFORM A TASK
Algorithmically; Computer algorithm; Properties of algorithms; Algorithim; Algoritmi de Numero Indorum; Algoritmi de numero indorum; Algoritmi De Numero Indorum; Алгоритм; Algorithem; Software logic; Computer algorithms; Encoding Algorithm; Naive algorithm; Naïve algorithm; Algorithm design; Algorithm segment; Algorithmic problem; Algorythm; Rule set; Continuous algorithm; Algorithms; Software-based; Algorithmic method; Algorhthym; Algorthym; Algorhythms; Formalization of algorithms; Mathematical algorithm; Draft:GE8151 Problem Solving and Python Programming; Computational algorithms; Optimization algorithms; Algorithm classification; History of algorithms; Patented algorithms; Algorithmus

математика

алгоритмический метод

Definição

Нью-Йорк пост
("Нью-Йорк пост")

ежедневная вечерняя газета в США. Основана в 1801. Издаётся в Нью-Йорке. Отражает интересы влиятельных монополистических кругов США. Тираж (1974) свыше 708 тыс. экземпляров.

Wikipédia

Dominator (graph theory)

In computer science, a node d of a control-flow graph dominates a node n if every path from the entry node to n must go through d. Notationally, this is written as d dom n (or sometimes dn). By definition, every node dominates itself.

There are a number of related concepts:

  • A node d strictly dominates a node n if d dominates n and d does not equal n.
  • The immediate dominator or idom of a node n is the unique node that strictly dominates n but does not strictly dominate any other node that strictly dominates n. Every node, except the entry node, has an immediate dominator.
  • The dominance frontier of a node d is the set of all nodes ni such that d dominates an immediate predecessor of ni, but d does not strictly dominate ni. It is the set of nodes where d's dominance stops.
  • A dominator tree is a tree where each node's children are those nodes it immediately dominates. The start node is the root of the tree.
Como se diz Post algorithm em Russo? Tradução de &#39Post algorithm&#39 em Russo